On self-clique graphs with triangular cliques
نویسندگان
چکیده
Abstract. A graph is an {r, s}-graph if the set of degrees of their vertices is {r, s}. A clique of a graph is a maximal complete subgraph. The clique graph K(G) of a graph G is the intersection graph of all its cliques. A graph G is self-clique if G is isomorphic to K(G). We show the existence of self-clique {5, 6}-graphs whose cliques are all triangles, thus solving a problem posed by Chia and Ong in [7].
منابع مشابه
Cohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملEdge clique graphs and some classes of chordal graphs
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe characterizations relative to edge clique graphs and some classes of chordal graphs, such as starlike, starlike-threshold, split and threshold graphs. In particular, a known necessary condition for a graph to be an edge c...
متن کاملOn hereditary clique-Helly self-clique graphs
A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-empty intersection, and it is hereditary clique-Helly (abbreviated HCH) if its induced subgraphs are clique-Helly. The clique graph of a graph G is the intersection graph of its cliques, and G is self-clique if it is connected and isomorphic to its clique graph. We show that every HCH graph is an induced su...
متن کاملA hierarchy of self-clique graphs
The clique graph K(G) of G is the intersection graph of all its (maximal) cliques. A connected graph G is self-clique whenever G ∼= K(G). Self-clique graphs have been studied in several papers. Here we propose a hierarchy of self-clique graphs: Type 3 ( Type 2 ( Type 1 ( Type 0. We give characterizations for classes of Types 3, 2 and 1 (including Helly self-clique graphs) and several new constr...
متن کاملSelf-clique Graphs with Prescribed Clique-sizes
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique whenever G ∼= K(G). This paper gives various constructions of self-clique graphs. In particular, we employ (r, g)-cages to construct self-clique graphs whose set of clique-sizes is any given finite set of integers greater than 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 339 شماره
صفحات -
تاریخ انتشار 2016